Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security

The demand for data security schemes has increased with the significant advancement in field of computation and communication networks. We propose a novel three-step text encryption scheme that provable against attacks such as key attack statistical attack. proposed is based on Pell sequence elliptic curves, where at first step plain diffused to get meaningless by applying cyclic shift symbol set. In second step, we hide elements from attackers. For this purpose, use sequence, weight function, binary encode each element into real numbers. encoded then confused generating permutations over curves third step. show sensitivity attacks. Furthermore, secure spacing attack, ciphertext only known-plaintext Compared some existing schemes, highly modern cryptanalysis.